Min-Wise Independent Linear Permutations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Min-Wise Independent Linear Permutations

A set of permutations F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have P (min{π(X)} = π(x)) = 1 |X| . This notion was introduced by Broder, Charikar, Frieze and Mitzenmacher and is motivated by an algorithm for filtering near-duplicate web documents. Linear permutations are an important class of permutations. Let p be a (large) prime a...

متن کامل

Min-Wise Independent Permutations

We define and study the notion of min-wise independent families of permutations. We say that F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr(min{π(X)} = π(x)) = 1 |X| . In other words we require that all the elements of any fixed set X have an equal chance to become the minimum element of the image of X under π. Our research was mo...

متن کامل

A Derandomization Using Min-Wise Independent Permutations

Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate min-wise independence allows similar uses, by presenting a derandomization of the RNC algorithm for approximate set cover due to S. Rajagopalan and V. Vazirani. We also ...

متن کامل

On (ε, k)-min-wise independent permutations

A family of permutations F of [n] = {1, 2, . . . , n} is (ε, k)-min-wise independent if for every nonempty subset X of at most k elements of [n], and for any x ∈ X, the probability that in a random element π of F , π(x) is the minimum element of π(X), deviates from 1/|X| by at most ε/|X|. This notion can be defined for the uniform case, when the elements of F are picked according to a uniform d...

متن کامل

Completeness and Robustness Properties of Min-Wise Independent Permutations

We provide several new results related to the concept of minwise independence. Our main result is that any randomized sampling scheme for the relative intersection of sets based on testing equality of samples yields an equivalent min-wise independent family. Thus, in a certain sense, min-wise independent families are \complete" for this type of estimation. We also discuss the notion of robustne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2000

ISSN: 1077-8926

DOI: 10.37236/1504